Foundations of Computational Mathematics

#	Item
31	ICM 2002 • Vol. I • 245^272 Mathematical Foundations of Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2012-04-18 10:56:38 Complexity classes Pseudorandomness Analysis of algorithms Probabilistic complexity theory One-way function Hard-core predicate NP P versus NP problem Time complexity Theoretical computer science Computational complexity theory Applied mathematics